Rainbow $$C_4$$ C 4 ’s and Directed $$C_4$$ C 4 ’s: The Bipartite Case Study
نویسندگان
چکیده
منابع مشابه
Purchasing a C_4 online
Let G be a graph with edge set (e1, e2, ...eN ). We independently associate to each edge ei of G a cost xi that is drawn from a Uniform [0, 1] distribution. Suppose F is a set of targeted structures that consists of subgraphs of G. We would like to buy a subset of F at small cost, however we do not know a priori the values of the random variables x1, ..., xN . Instead, we inspect the random var...
متن کاملComputation of the Ramsey Numbers $R(C_4, K_9)$ and $R(C_4, K_{10})$
The Ramsey number R(C4,Km) is the smallest n such that any graph on n vertices contains a cycle of length four or an independent set of order m. With the help of computer algorithms we obtain the exact values of the Ramsey numbers R(C4,K9) = 30 and R(C4,K10) = 36. New bounds for the next two open cases are also presented.
متن کاملParallel Positive Justification in SDH C_4 Mapping
Bit Rate Justification is a key technique in digital multiplexing. SDH adopts Positive Justification for C-4 mapping and PositivelZeroMegative Justification for other mappings. The mapping of C-4 has the highest system frequency in all Bit Rate Justifications of SDH. This demands highly on the technology and power consumption in the ASIC design. This paper puts forward a novel technique of Posi...
متن کاملCTLA-4 Gene Haplotypes and the Risk of Chronic Hepatitis C Infection; a Case Control Study
Background: The prevalence of hepatitis C virus (HCV) infection is increasing worldwide. Cytotoxic T-lymphocyte-associated protein 4 (CTLA-4) may play a role in the intensity of the disease. The aim of this study was to evaluate the association between genetic variants of the CTLA-4 and HCV infection. Methods: Restriction fragment length polymorphism-polymerase chain reaction (RFLP-PCR) was ...
متن کاملLinearly $\chi$-Bounding $(P_6,C_4)$-Free Graphs
Given two graphs H1 and H2, a graph G is (H1,H2)-free if it contains no subgraph isomorphic to H1 or H2. Let Pt and Cs be the path on t vertices and the cycle on s vertices, respectively. In this paper we show that for any (P6, C4)-free graph G it holds that χ(G) ≤ 3 2 ω(G), where χ(G) and ω(G) are the chromatic number and clique number of G, respectively. Our bound is attained by several graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Malaysian Mathematical Sciences Society
سال: 2015
ISSN: 0126-6705,2180-4206
DOI: 10.1007/s40840-015-0125-1